Binary Min-Heap

A Binary Heap is a complete binary tree where the parent is always smaller than its children (Min-Heap). It is efficiently stored as an array but visualized as a tree. Watch how elements "bubble up" or "sift down" to maintain the order.